A Theory of Numerical Patterns: Numerical ”Kolmogorov Complexity” Theory
نویسنده
چکیده
Intuitively, patterns of numerical sequences are often interpreted as formulas. However, we have observed earlier that such an intuition is too naive. Numerical Kolmogorov complexity theory is further developed. Based on these new formulations, a sequence is random if There is no patterns that are simpler than the complexity of data.
منابع مشابه
Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures
We show that real-value approximations of Kolmogorov-Chaitin (Km) using the algorithmic Coding theorem as calculated from the output frequency of a large set of small deterministic Turing machines with up to 5 states (and 2 symbols), is in agreement with the number of instructions used by the Turing machines producing s, which is consistent with strict integer-value program-size complexity. Nev...
متن کاملSize-dependent thermoelastic analysis of rotating nanodisks of variable thickness
This paper contains a strain gradient theory to capture size effects in rotating nanodisks of variable thickness under thermal and mechanical loading. Material properties of nanodisks have been taken homogeneous material. The strain gradient theory and the Hamilton’s principle are employed to derive the governing equations. Due to complexity of the governing differential equation and boundary c...
متن کاملMethods of information theory and algorithmic complexity for network biology.
We survey and introduce concepts and tools located at the intersection of information theory and network biology. We show that Shannon's information entropy, compressibility and algorithmic complexity quantify different local and global aspects of synthetic and biological data. We show examples such as the emergence of giant components in Erdös-Rényi random graphs, and the recovery of topologic...
متن کاملSome results on the block numerical range
The main results of this paper are generalizations of classical results from the numerical range to the block numerical range. A different and simpler proof for the Perron-Frobenius theory on the block numerical range of an irreducible nonnegative matrix is given. In addition, the Wielandt's lemma and the Ky Fan's theorem on the block numerical range are extended.
متن کاملPERRON-FROBENIUS THEORY ON THE NUMERICAL RANGE FOR SOME CLASSES OF REAL MATRICES
We give further results for Perron-Frobenius theory on the numericalrange of real matrices and some other results generalized from nonnegative matricesto real matrices. We indicate two techniques for establishing the main theorem ofPerron and Frobenius on the numerical range. In the rst method, we use acorresponding version of Wielandt's lemma. The second technique involves graphtheory.
متن کامل